0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.11	% Command    : run_vampire %s %d THM
0.11/0.32	% Computer : n015.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1440
0.11/0.32	% WCLimit    : 180
0.11/0.32	% DateTime   : Thu Jul  4 07:46:54 EDT 2024
0.11/0.32	% CPUTime    : 
0.11/0.33	This is a THF_ problem
0.11/0.33	Running higher-order theorem proving
0.11/0.34	Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.0jHaygPVic/E---3.1_28195.p -m 16384 -t 180
0.11/0.36	% (28303)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_28195 for (1799ds/183Mi)
0.11/0.36	% (28307)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_28195 for (1799ds/2Mi)
0.11/0.36	% (28309)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_28195 for (1799ds/18Mi)
0.11/0.36	% (28304)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_28195 for (1799ds/4Mi)
0.11/0.36	% (28308)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_28195 for (1799ds/275Mi)
0.11/0.36	% (28306)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_28195 for (1799ds/2Mi)
0.11/0.36	% (28306)Instruction limit reached!
0.11/0.36	% (28306)------------------------------
0.11/0.36	% (28306)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.11/0.36	% (28305)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_28195 for (1799ds/27Mi)
0.11/0.36	% (28306)Termination reason: Unknown
0.11/0.36	% (28307)Instruction limit reached!
0.11/0.36	% (28307)------------------------------
0.11/0.36	% (28307)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.11/0.36	% (28307)Termination reason: Unknown
0.11/0.36	% (28307)Termination phase: Saturation
0.11/0.36	
0.11/0.36	% (28307)Memory used [KB]: 895
0.11/0.36	% (28307)Time elapsed: 0.003 s
0.11/0.36	% (28307)Instructions burned: 2 (million)
0.11/0.36	% (28307)------------------------------
0.11/0.36	% (28307)------------------------------
0.11/0.36	% (28306)Termination phase: Property scanning
0.11/0.36	
0.11/0.36	% (28306)Memory used [KB]: 895
0.11/0.36	% (28306)Time elapsed: 0.003 s
0.11/0.36	% (28306)Instructions burned: 2 (million)
0.11/0.36	% (28306)------------------------------
0.11/0.36	% (28306)------------------------------
0.11/0.36	% (28308)Refutation not found, incomplete strategy
0.11/0.36	% (28308)------------------------------
0.11/0.36	% (28308)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.11/0.36	% (28308)Termination reason: Refutation not found, incomplete strategy
0.11/0.36	
0.11/0.36	
0.11/0.36	% (28308)Memory used [KB]: 5500
0.11/0.36	% (28308)Time elapsed: 0.003 s
0.11/0.36	% (28308)Instructions burned: 1 (million)
0.11/0.36	% (28308)------------------------------
0.11/0.36	% (28308)------------------------------
0.11/0.36	% (28304)Instruction limit reached!
0.11/0.36	% (28304)------------------------------
0.11/0.36	% (28304)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.11/0.36	% (28304)Termination reason: Unknown
0.11/0.36	% (28304)Termination phase: Saturation
0.11/0.36	
0.11/0.36	% (28304)Memory used [KB]: 5500
0.11/0.36	% (28304)Time elapsed: 0.005 s
0.11/0.36	% (28304)Instructions burned: 5 (million)
0.11/0.36	% (28304)------------------------------
0.11/0.36	% (28304)------------------------------
0.11/0.36	% (28309)First to succeed.
0.11/0.36	% (28303)Also succeeded, but the first one will report.
0.11/0.36	% (28305)Also succeeded, but the first one will report.
0.11/0.36	% (28309)Refutation found. Thanks to Tanya!
0.11/0.36	% SZS status Theorem for E---3.1_28195
0.11/0.36	% SZS output start Proof for E---3.1_28195
0.11/0.36	thf(func_def_0, type, eps: ($i > $o) > $i).
0.11/0.36	thf(func_def_1, type, if: $o > $i > $i > $i).
0.11/0.36	thf(func_def_17, type, ph3: !>[X0: $tType]:(X0)).
0.11/0.36	thf(func_def_18, type, sK4: $i > $i).
0.11/0.36	thf(f68,plain,(
0.11/0.36	  $false),
0.11/0.36	  inference(avatar_sat_refutation,[],[f39,f65,f67])).
0.11/0.36	thf(f67,plain,(
0.11/0.36	  spl2_2),
0.11/0.36	  inference(avatar_contradiction_clause,[],[f66])).
0.11/0.36	thf(f66,plain,(
0.11/0.36	  $false | spl2_2),
0.11/0.36	  inference(subsumption_resolution,[],[f38,f40])).
0.11/0.36	thf(f40,plain,(
0.11/0.36	  ( ! [X0 : $i] : (((eps @ (= @ X0)) = X0)) )),
0.11/0.36	  inference(leibniz_equality_elimination,[],[f16])).
0.11/0.36	thf(f16,plain,(
0.11/0.36	  ( ! [X0 : $i > $o,X1 : $i] : (($true != (X0 @ X1)) | ((X0 @ (eps @ X0)) = $true)) )),
0.11/0.36	  inference(cnf_transformation,[],[f13])).
0.11/0.36	thf(f13,plain,(
0.11/0.36	  ! [X0 : $i > $o] : (((X0 @ (eps @ X0)) = $true) | ! [X1] : ($true != (X0 @ X1)))),
0.11/0.36	  inference(ennf_transformation,[],[f7])).
0.11/0.36	thf(f7,plain,(
0.11/0.36	  ! [X0 : $i > $o] : (? [X1] : ($true = (X0 @ X1)) => ((X0 @ (eps @ X0)) = $true))),
0.11/0.36	  inference(fool_elimination,[],[f6])).
0.11/0.36	thf(f6,plain,(
0.11/0.36	  ! [X0 : $i > $o] : (? [X1] : (X0 @ X1) => (X0 @ (eps @ X0)))),
0.11/0.36	  inference(rectify,[],[f2])).
0.11/0.36	thf(f2,axiom,(
0.11/0.36	  ! [X4 : $i > $o] : (? [X1] : (X4 @ X1) => (X4 @ (eps @ X4)))),
0.11/0.36	  file('/export/starexec/sandbox/tmp/tmp.0jHaygPVic/E---3.1_28195.p',choiceax)).
0.11/0.36	thf(f38,plain,(
0.11/0.36	  ((eps @ (= @ sK1)) != sK1) | spl2_2),
0.11/0.36	  inference(avatar_component_clause,[],[f36])).
0.11/0.36	thf(f36,plain,(
0.11/0.36	  spl2_2 <=> ((eps @ (= @ sK1)) = sK1)),
0.11/0.36	  introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
0.11/0.36	thf(f65,plain,(
0.11/0.36	  spl2_1),
0.11/0.36	  inference(avatar_contradiction_clause,[],[f64])).
0.11/0.36	thf(f64,plain,(
0.11/0.36	  $false | spl2_1),
0.11/0.36	  inference(trivial_inequality_removal,[],[f63])).
0.11/0.36	thf(f63,plain,(
0.11/0.36	  (sK0 != sK0) | spl2_1),
0.11/0.36	  inference(duplicate_literal_removal,[],[f62])).
0.11/0.36	thf(f62,plain,(
0.11/0.36	  (sK0 != sK0) | (sK0 != sK0) | (sK0 != sK0) | spl2_1),
0.11/0.36	  inference(superposition,[],[f57,f61])).
0.11/0.36	thf(f61,plain,(
0.11/0.36	  ((sK4 @ sK0) = sK0) | spl2_1),
0.11/0.36	  inference(duplicate_literal_removal,[],[f60])).
0.11/0.36	thf(f60,plain,(
0.11/0.36	  ((sK4 @ sK0) = sK0) | ((sK4 @ sK0) = sK0) | spl2_1),
0.11/0.36	  inference(equality_resolution,[],[f59])).
0.11/0.36	thf(f59,plain,(
0.11/0.36	  ( ! [X0 : $i] : ((sK0 != X0) | (sK0 = (sK4 @ X0)) | ((sK4 @ X0) = X0)) ) | spl2_1),
0.11/0.36	  inference(equality_proxy_clausification,[],[f58])).
0.11/0.36	thf(f58,plain,(
0.11/0.36	  ( ! [X0 : $i] : (((sK4 @ X0) = X0) | ((sK0 = (sK4 @ X0)) = $true) | (sK0 != X0)) ) | spl2_1),
0.11/0.36	  inference(equality_proxy_clausification,[],[f54])).
0.11/0.36	thf(f54,plain,(
0.11/0.36	  ( ! [X0 : $i] : (($true = (X0 = (sK4 @ X0))) | (sK0 != X0) | ((sK0 = (sK4 @ X0)) = $true)) ) | spl2_1),
0.11/0.36	  inference(binary_proxy_clausification,[],[f53])).
0.11/0.36	thf(f53,plain,(
0.11/0.36	  ( ! [X0 : $i] : (((sK0 = (sK4 @ X0)) != (X0 = (sK4 @ X0))) | (sK0 != X0)) ) | spl2_1),
0.11/0.36	  inference(negative_extensionality,[],[f52])).
0.11/0.36	thf(f52,plain,(
0.11/0.36	  ( ! [X0 : $i] : (((= @ X0) != (= @ sK0)) | (sK0 != X0)) ) | spl2_1),
0.11/0.36	  inference(constrained_superposition,[],[f34,f40])).
0.11/0.36	thf(f34,plain,(
0.11/0.36	  ((eps @ (= @ sK0)) != sK0) | spl2_1),
0.11/0.36	  inference(avatar_component_clause,[],[f32])).
0.11/0.36	thf(f32,plain,(
0.11/0.36	  spl2_1 <=> ((eps @ (= @ sK0)) = sK0)),
0.11/0.36	  introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
0.11/0.36	thf(f57,plain,(
0.11/0.36	  ( ! [X0 : $i] : ((sK0 != (sK4 @ X0)) | ((sK4 @ X0) != X0) | (sK0 != X0)) ) | spl2_1),
0.11/0.36	  inference(equality_proxy_clausification,[],[f56])).
0.11/0.36	thf(f56,plain,(
0.11/0.36	  ( ! [X0 : $i] : ((sK0 != X0) | ((sK4 @ X0) != X0) | ($false = (sK0 = (sK4 @ X0)))) ) | spl2_1),
0.11/0.36	  inference(equality_proxy_clausification,[],[f55])).
0.11/0.36	thf(f55,plain,(
0.11/0.36	  ( ! [X0 : $i] : (($false = (X0 = (sK4 @ X0))) | ($false = (sK0 = (sK4 @ X0))) | (sK0 != X0)) ) | spl2_1),
0.11/0.36	  inference(binary_proxy_clausification,[],[f53])).
0.11/0.36	thf(f39,plain,(
0.11/0.36	  ~spl2_1 | ~spl2_2),
0.11/0.36	  inference(avatar_split_clause,[],[f30,f36,f32])).
0.11/0.36	thf(f30,plain,(
0.11/0.36	  ((eps @ (= @ sK1)) != sK1) | ((eps @ (= @ sK0)) != sK0)),
0.11/0.36	  inference(beta_eta_normalization,[],[f29])).
0.11/0.36	thf(f29,plain,(
0.11/0.36	  ((eps @ (= @ sK1)) != sK1) | ((eps @ (^[Y0 : $i]: (sK0 = Y0))) != sK0)),
0.11/0.36	  inference(boolean_simplification,[],[f28])).
0.11/0.36	thf(f28,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: ($false | (sK0 = Y0)))) != sK0) | ((eps @ (= @ sK1)) != sK1)),
0.11/0.36	  inference(boolean_simplification,[],[f27])).
0.11/0.36	thf(f27,plain,(
0.11/0.36	  ((eps @ (= @ sK1)) != sK1) | ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | (sK0 = Y0)))) != sK0)),
0.11/0.36	  inference(boolean_simplification,[],[f26])).
0.11/0.36	thf(f26,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | ((sK0 = Y0) & $true)))) != sK0) | ((eps @ (= @ sK1)) != sK1)),
0.11/0.36	  inference(beta_eta_normalization,[],[f25])).
0.11/0.36	thf(f25,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | ((sK0 = Y0) & $true)))) != sK0) | ((eps @ (^[Y0 : $i]: (sK1 = Y0))) != sK1)),
0.11/0.36	  inference(boolean_simplification,[],[f24])).
0.11/0.36	thf(f24,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: ($true & (sK1 = Y0)))) != sK1) | ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | ((sK0 = Y0) & $true)))) != sK0)),
0.11/0.36	  inference(boolean_simplification,[],[f23])).
0.11/0.36	thf(f23,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: (($true & (sK1 = Y0)) | $false))) != sK1) | ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | ((sK0 = Y0) & $true)))) != sK0)),
0.11/0.36	  inference(boolean_simplification,[],[f22])).
0.11/0.36	thf(f22,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: (($true & (sK1 = Y0)) | ((sK0 = Y0) & $false)))) != sK1) | ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | ((sK0 = Y0) & $true)))) != sK0)),
0.11/0.36	  inference(boolean_simplification,[],[f21])).
0.11/0.36	thf(f21,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | ((sK0 = Y0) & (~ $false))))) != sK0) | ((eps @ (^[Y0 : $i]: (($true & (sK1 = Y0)) | ((sK0 = Y0) & $false)))) != sK1)),
0.11/0.36	  inference(boolean_simplification,[],[f20])).
0.11/0.36	thf(f20,plain,(
0.11/0.36	  ((eps @ (^[Y0 : $i]: (($true & (sK1 = Y0)) | ((sK0 = Y0) & (~ $true))))) != sK1) | ((eps @ (^[Y0 : $i]: (($false & (sK1 = Y0)) | ((sK0 = Y0) & (~ $false))))) != sK0)),
0.11/0.36	  inference(beta_eta_normalization,[],[f19])).
0.11/0.36	thf(f19,plain,(
0.11/0.36	  (((^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))) @ $true @ sK1 @ sK0) != sK1) | (((^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))) @ $false @ sK1 @ sK0) != sK0)),
0.11/0.36	  inference(definition_unfolding,[],[f18,f17,f17])).
0.11/0.36	thf(f17,plain,(
0.11/0.36	  (if = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))))),
0.11/0.36	  inference(cnf_transformation,[],[f11])).
0.11/0.36	thf(f11,plain,(
0.11/0.36	  (if = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))))),
0.11/0.36	  inference(fool_elimination,[],[f10])).
0.11/0.36	thf(f10,plain,(
0.11/0.36	  (if = (^[X0 : $o, X1 : $i, X2 : $i] : (eps @ (^[X3 : $i] : ((~X0 & (X2 = X3)) | ((X1 = X3) & X0))))))),
0.11/0.36	  inference(rectify,[],[f1])).
0.11/0.36	thf(f1,axiom,(
0.11/0.36	  (if = (^[X0 : $o, X1 : $i, X2 : $i] : (eps @ (^[X3 : $i] : ((~X0 & (X2 = X3)) | ((X1 = X3) & X0))))))),
0.11/0.36	  file('/export/starexec/sandbox/tmp/tmp.0jHaygPVic/E---3.1_28195.p',ifd)).
0.11/0.36	thf(f18,plain,(
0.11/0.36	  ((if @ $false @ sK1 @ sK0) != sK0) | ((if @ $true @ sK1 @ sK0) != sK1)),
0.11/0.36	  inference(cnf_transformation,[],[f15])).
0.11/0.36	thf(f15,plain,(
0.11/0.36	  ((if @ $false @ sK1 @ sK0) != sK0) | ((if @ $true @ sK1 @ sK0) != sK1)),
0.11/0.36	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f14])).
0.11/0.36	thf(f14,plain,(
0.11/0.36	  ? [X0,X1] : (((if @ $false @ X1 @ X0) != X0) | ((if @ $true @ X1 @ X0) != X1)) => (((if @ $false @ sK1 @ sK0) != sK0) | ((if @ $true @ sK1 @ sK0) != sK1))),
0.11/0.36	  introduced(choice_axiom,[])).
0.11/0.36	thf(f12,plain,(
0.11/0.36	  ? [X0,X1] : (((if @ $false @ X1 @ X0) != X0) | ((if @ $true @ X1 @ X0) != X1))),
0.11/0.36	  inference(ennf_transformation,[],[f9])).
0.11/0.36	thf(f9,plain,(
0.11/0.36	  ~! [X0,X1] : (((if @ $true @ X1 @ X0) = X1) & ((if @ $false @ X1 @ X0) = X0))),
0.11/0.36	  inference(fool_elimination,[],[f8])).
0.11/0.36	thf(f8,plain,(
0.11/0.36	  ~! [X0,X1] : ((X0 = (if @ $false @ X1 @ X0)) & ((if @ $true @ X1 @ X0) = X1))),
0.11/0.36	  inference(rectify,[],[f4])).
0.11/0.36	thf(f4,negated_conjecture,(
0.11/0.36	  ~! [X2,X1] : ((X2 = (if @ $false @ X1 @ X2)) & ((if @ $true @ X1 @ X2) = X1))),
0.11/0.36	  inference(negated_conjecture,[],[f3])).
0.11/0.36	thf(f3,conjecture,(
0.11/0.36	  ! [X2,X1] : ((X2 = (if @ $false @ X1 @ X2)) & ((if @ $true @ X1 @ X2) = X1))),
0.11/0.36	  file('/export/starexec/sandbox/tmp/tmp.0jHaygPVic/E---3.1_28195.p',conj)).
0.11/0.36	% SZS output end Proof for E---3.1_28195
0.11/0.36	% (28309)------------------------------
0.11/0.36	% (28309)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.11/0.36	% (28309)Termination reason: Refutation
0.11/0.36	
0.11/0.36	% (28309)Memory used [KB]: 5500
0.11/0.36	% (28309)Time elapsed: 0.006 s
0.11/0.36	% (28309)Instructions burned: 3 (million)
0.11/0.36	% (28309)------------------------------
0.11/0.36	% (28309)------------------------------
0.11/0.36	% (28302)Success in time 0.007 s
0.11/0.37	EOF
